Optimal working point in digitized quantum annealing
نویسندگان
چکیده
منابع مشابه
Optimal Surface Reconstruction from Digitized Point Data using CI Methods
In many scienti c and technological endeavors, a three-dimensional solid must be reconstructed from digitized point data. This paper presents three solutions to the problem of reconstructing smooth surfaces using triangular tiles. The presented algorithms di er in their strategic approach. Here, two deterministic algorithms and one non-deterministic CI (computational intelligence) strategy will...
متن کاملOptimal Surface Reconstruction from Digitized Point Data using CI
In many scientiic and technological endeavors, a three-dimensional solid must be reconstructed from digitized point data. This paper presents three solutions to the problem of reconstructing smooth surfaces using triangular tiles. The presented algorithms diier in their strategic approach. Here, two deterministic algorithms and one non-deterministic CI (computational intelligence) strategy will...
متن کاملQuantum annealing
Quantum annealing Quantum annealing (also known as alloy, crystallization or tempering) is analogous to simulated annealing but in substitution of thermal activation by quantum tunneling. The class of algorithmic methods for quantum annealing (dubbed: 'QA'), sometimes referred by the italian school as Quantum Stochastic Optimization ('QSO'), is a promising metaheuristic tool for solving local s...
متن کاملQuantum speedup by quantum annealing.
We study the glued-trees problem from A. M. Childs, R. Cleve, E. Deotto, E. Farhi, S. Gutmann, and D. Spielman, in Proceedings of the 35th Annual ACM Symposium on Theory of Computing (ACM, San Diego, CA, 2003), p. 59. in the adiabatic model of quantum computing and provide an annealing schedule to solve an oracular problem exponentially faster than classically possible. The Hamiltonians involve...
متن کاملFaster Annealing Schedules for Quantum Annealing
New annealing schedules for quantum annealing are proposed based on the adiabatic theorem. These schedules exhibit faster decrease of the excitation probability than a linear schedule. To derive this conclusion, the asymptotic form of the excitation probability for quantum annealing is explicitly obtained in the limit of long annealing time. Its first-order term, which is inversely proportional...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Physical Review B
سال: 2019
ISSN: 2469-9950,2469-9969
DOI: 10.1103/physrevb.100.224201